Pseudorandom recursions II
نویسندگان
چکیده
منابع مشابه
Pseudorandom recursions II
We present our earlier results (not included in Hars and Petruska due to space and time limitations), as well as some updated versions of those, and a few more recent pseudorandom number generator designs. These tell a systems designer which computer word lengths are suitable for certain high-quality pseudorandom number generators, and which constructions of a large family of designs provide lo...
متن کاملParallel Pseudorandom Number Generation Using Additive Lagged-fibonacci Recursions
We study the suitability of the additive lagged-Fibonacci pseudorandom number generator for parallel computation. This generator has a relatively short period with respect to the size of its seed. However, the short period is more than made up for with the huge number of full-period cycles it contains. We call these diierent full-period cycles equivalence classes. We show how to enumerate the e...
متن کاملPseudorandom Recursions: Small and Fast Pseudorandom Number Generators for Embedded Applications
Many new small and fast pseudorandom number generators are presented, which pass the most common randomness tests. They perform only a few, nonmultiplicative operations for each generated number, use very little memory, therefore, they are ideal for embedded applications. We present general methods to ensure very long cycles and show, how to create super fast, very small ciphers and hash functi...
متن کاملFractals, recursions, divisibility
The self similar (fractal) structure of the Pascal triangle of binomial coefficients modulo some fixed prime has been known for some time and explored in detail. It turns out that such a fractal structure is the common property arithmetical functions of two variables possessing a more general recursive relation (R) f(i,j) = af(i-l,j) + bf(i 1,j-1) where a and b are fixed integers. 'When a, b ar...
متن کاملRunning Modulus Recursions
Fix integers b ≥ 2 and k ≥ 1. Define the sequence {zn} recursively by taking z0 to be any integer, and for n ≥ 1, take zn to be the least nonnegative residue of bzn−1 modulo (n + k). Since the modulus increases by 1 when stepping from one term to the next, such a definition will be called a running modulus recursion or rumor for short. While the terms of such sequences appear to bounce around i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Embedded Systems
سال: 2012
ISSN: 1687-3963
DOI: 10.1186/1687-3963-2012-1